LUC: A New Public Key System
نویسندگان
چکیده
We describe public key cryptosystems and analyse the RSA cryptosystem, pointing out a weakness (already known) of the RSA system. We define Lucas functions and derive some of their properties. Then we introduce a public key system based on Lucas functions instead of exponentiation. The computational requirements of the new system are only a little greater than those for the RSA system, and we prove that the new system is cryptographically stronger than the RSA system. Finally, we present a Lucas function equivalent of the DiffieHellman key negotiation method. Keyword Codes: E.3; K.4.2; K.6.5
منابع مشابه
A New Reporter Gene Technology: Opportunities and Perspectives
The paper summarizes the current status of the reporter gene technology and their basics. Reporter gene technology is widely used to monitor cellular events associated with gene expression and signal transduction. Based upon the splicing of transcriptional control elements to a variety of reporter genes, it “reports” the effects of a cascade of signaling events on gene expression inside cells. ...
متن کاملA NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کاملTorus-Based Cryptography
We introduce the concept of torus-based cryptography, give a new public key system called CEILIDH, and compare it to other discrete log based systems including Lucas-based systems and XTR. Like those systems, we obtain small key sizes. While Lucas-based systems and XTR are essentially restricted to exponentiation, we are able to perform multiplication as well. We also disprove the open conjectu...
متن کاملAn efficient probabilistic public-key cryptosystem over quadratic fields quotients
We present a new probabilistic cryptosystem working in quadratic fields quotients. Computation in such objects can be done efficiently with Lucas sequences which help to design a fast system. The security of the scheme is based on the LUC problem and its semantic security on a new decisional problem. This system appears to be an alternative to schemes based on the RSA primitive and has a full c...
متن کاملReduce Computation Steps Can Increase the Efficiency of Computation Algorithm
Problem statement: Lucas function is a special form of second-order linear recurrence relation. It is used in LUC cryptosystems. The performance of LUC cryptosystem depends on the size of public key, messages and two relatively primes. The increasing of size of these parameters will increase the computation time need to perform the LUC Cryptosystem computation. The efficiency means the quality ...
متن کامل